0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : run_E %s %d THM
0.10/0.32	% Computer : n032.cluster.edu
0.10/0.32	% Model    : x86_64 x86_64
0.10/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory   : 8042.1875MB
0.10/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1440
0.10/0.32	% WCLimit    : 180
0.10/0.32	% DateTime   : Thu Jul  4 08:43:23 EDT 2024
0.10/0.32	% CPUTime    : 
0.17/0.45	Running higher-order theorem proving
0.17/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.nSSoFtQtks/E---3.1_6558.p
3.83/1.02	# Version: 3.2.0-ho
3.83/1.02	# Preprocessing class: HSLSSMSMSSMNHSA.
3.83/1.02	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
3.83/1.02	# Starting ehoh_best2 with 900s (5) cores
3.83/1.02	# Starting additional_ho_6 with 180s (1) cores
3.83/1.02	# Starting new_bool_5 with 180s (1) cores
3.83/1.02	# Starting new_bool_1 with 180s (1) cores
3.83/1.02	# additional_ho_6 with pid 6637 completed with status 0
3.83/1.02	# Result found by additional_ho_6
3.83/1.02	# Preprocessing class: HSLSSMSMSSMNHSA.
3.83/1.02	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
3.83/1.02	# Starting ehoh_best2 with 900s (5) cores
3.83/1.02	# Starting additional_ho_6 with 180s (1) cores
3.83/1.02	# SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
3.83/1.02	# Search class: HGHSM-FSLM32-MHSFFSBN
3.83/1.02	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
3.83/1.02	# Starting new_ho_10 with 98s (1) cores
3.83/1.02	# new_ho_10 with pid 6642 completed with status 0
3.83/1.02	# Result found by new_ho_10
3.83/1.02	# Preprocessing class: HSLSSMSMSSMNHSA.
3.83/1.02	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
3.83/1.02	# Starting ehoh_best2 with 900s (5) cores
3.83/1.02	# Starting additional_ho_6 with 180s (1) cores
3.83/1.02	# SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
3.83/1.02	# Search class: HGHSM-FSLM32-MHSFFSBN
3.83/1.02	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
3.83/1.02	# Starting new_ho_10 with 98s (1) cores
3.83/1.02	# Preprocessing time       : 0.009 s
3.83/1.02	# Presaturation interreduction done
3.83/1.02	
3.83/1.02	# Proof found!
3.83/1.02	# SZS status Theorem
3.83/1.02	# SZS output start CNFRefutation
3.83/1.02	thf(decl_sort1, type, set_val: $tType).
3.83/1.02	thf(decl_sort2, type, g: $tType).
3.83/1.02	thf(decl_sort3, type, list_node: $tType).
3.83/1.02	thf(decl_sort4, type, node: $tType).
3.83/1.02	thf(decl_sort5, type, list_P561207620_edgeD: $tType).
3.83/1.02	thf(decl_sort6, type, val: $tType).
3.83/1.02	thf(decl_sort7, type, produc1432036078de_val: $tType).
3.83/1.02	thf(decl_sort8, type, option_list_val: $tType).
3.83/1.02	thf(decl_24, type, graph_1012773594_edgeD: (g > list_node) > (g > $o) > (g > node > list_P561207620_edgeD) > g > node > list_node > node > $o).
3.83/1.02	thf(decl_28, type, append_node: list_node > list_node > list_node).
3.83/1.02	thf(decl_39, type, hd_node: list_node > node).
3.83/1.02	thf(decl_45, type, tl_node: list_node > list_node).
3.83/1.02	thf(decl_50, type, sSA_CF551432799de_val: (g > list_node) > (g > node > set_val) > (g > produc1432036078de_val > option_list_val) > g > val > node).
3.83/1.02	thf(decl_59, type, alpha_n: g > list_node).
3.83/1.02	thf(decl_60, type, phi_r: val).
3.83/1.02	thf(decl_61, type, defs: g > node > set_val).
3.83/1.02	thf(decl_62, type, g2: g).
3.83/1.02	thf(decl_63, type, i: node).
3.83/1.02	thf(decl_64, type, inEdges: g > node > list_P561207620_edgeD).
3.83/1.02	thf(decl_65, type, invar: g > $o).
3.83/1.02	thf(decl_69, type, n: node).
3.83/1.02	thf(decl_70, type, ns: list_node).
3.83/1.02	thf(decl_71, type, phis: g > produc1432036078de_val > option_list_val).
3.83/1.02	thf(decl_73, type, r: val).
3.83/1.02	thf(decl_74, type, ri: list_node).
3.83/1.02	thf(decl_76, type, rs2: list_node).
3.83/1.02	thf(fact_264_old_Opath2__hd, axiom, ![X13:g, X14:node, X15:list_node, X16:node]:(((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X14 @ X15 @ X16)=>((X14)=(hd_node @ X15)))), file('/export/starexec/sandbox/tmp/tmp.nSSoFtQtks/E---3.1_6558.p', fact_264_old_Opath2__hd)).
3.83/1.02	thf(fact_9_rs__props_I1_J, axiom, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ rs2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r)), file('/export/starexec/sandbox/tmp/tmp.nSSoFtQtks/E---3.1_6558.p', fact_9_rs__props_I1_J)).
3.83/1.02	thf(fact_1_ri__is__valid, axiom, ((i)=(sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r)), file('/export/starexec/sandbox/tmp/tmp.nSSoFtQtks/E---3.1_6558.p', fact_1_ri__is__valid)).
3.83/1.02	thf(fact_4_ri__props_I1_J, axiom, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i), file('/export/starexec/sandbox/tmp/tmp.nSSoFtQtks/E---3.1_6558.p', fact_4_ri__props_I1_J)).
3.83/1.02	thf(conj_0, conjecture, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r)), file('/export/starexec/sandbox/tmp/tmp.nSSoFtQtks/E---3.1_6558.p', conj_0)).
3.83/1.02	thf(fact_5_old_Opath2__app, axiom, ![X13:g, X14:node, X15:list_node, X16:node, X139:list_node, X140:node]:((((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X14 @ (append_node @ X15 @ (tl_node @ X139)) @ X140)<=(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X16 @ X139 @ X140))<=(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X14 @ X15 @ X16))), file('/export/starexec/sandbox/tmp/tmp.nSSoFtQtks/E---3.1_6558.p', fact_5_old_Opath2__app)).
3.83/1.02	thf(fact_3_assms_I7_J, axiom, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r)), file('/export/starexec/sandbox/tmp/tmp.nSSoFtQtks/E---3.1_6558.p', fact_3_assms_I7_J)).
3.83/1.02	thf(c_0_7, plain, ![X1454:g, X1455:node, X1456:list_node, X1457:node]:((~(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1454 @ X1455 @ X1456 @ X1457)|((X1455)=(hd_node @ X1456)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_264_old_Opath2__hd])])])).
3.83/1.02	thf(c_0_8, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ rs2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r)), inference(split_conjunct,[status(thm)],[fact_9_rs__props_I1_J])).
3.83/1.02	thf(c_0_9, plain, ((i)=(sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r)), inference(split_conjunct,[status(thm)],[fact_1_ri__is__valid])).
3.83/1.02	thf(c_0_10, plain, ![X2:list_node, X3:node, X13:g, X10:node]:((((X3)=(hd_node @ X2))|~((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X3 @ X2 @ X10)))), inference(split_conjunct,[status(thm)],[c_0_7])).
3.83/1.02	thf(c_0_11, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i), inference(split_conjunct,[status(thm)],[fact_4_ri__props_I1_J])).
3.83/1.02	thf(c_0_12, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ rs2 @ i), inference(rw,[status(thm)],[c_0_8, c_0_9])).
3.83/1.02	thf(c_0_13, plain, ((sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r)=(hd_node @ ri)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
3.83/1.02	thf(c_0_14, negated_conjecture, ~(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
3.83/1.02	thf(c_0_15, plain, ![X13:g, X14:node, X15:list_node, X16:node, X139:list_node, X140:node]:(((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X14 @ X15 @ X16)=>((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X16 @ X139 @ X140)=>(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X14 @ (append_node @ X15 @ (tl_node @ X139)) @ X140)))), inference(fof_simplification,[status(thm)],[fact_5_old_Opath2__app])).
3.83/1.02	thf(c_0_16, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (hd_node @ ri) @ rs2 @ i), inference(rw,[status(thm)],[c_0_12, c_0_13])).
3.83/1.02	thf(c_0_17, negated_conjecture, ~(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r)), inference(fof_nnf,[status(thm)],[c_0_14])).
3.83/1.02	thf(c_0_18, plain, ![X1448:g, X1449:node, X1450:list_node, X1451:node, X1452:list_node, X1453:node]:((~(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1448 @ X1449 @ X1450 @ X1451)|(~(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1448 @ X1451 @ X1452 @ X1453)|(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1448 @ X1449 @ (append_node @ X1450 @ (tl_node @ X1452)) @ X1453)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
3.83/1.02	thf(c_0_19, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (hd_node @ ri) @ ri @ i), inference(rw,[status(thm)],[c_0_11, c_0_13])).
3.83/1.02	thf(c_0_20, plain, ((hd_node @ ri)=(hd_node @ rs2)), inference(spm,[status(thm)],[c_0_10, c_0_16])).
3.83/1.02	thf(c_0_21, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r)), inference(split_conjunct,[status(thm)],[fact_3_assms_I7_J])).
3.83/1.02	thf(c_0_22, negated_conjecture, ~((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r))), inference(split_conjunct,[status(thm)],[c_0_17])).
3.83/1.02	thf(c_0_23, plain, ![X2:list_node, X3:node, X4:list_node, X10:node, X13:g, X11:node]:(((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X3 @ (append_node @ X2 @ (tl_node @ X4)) @ X11)|~((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X3 @ X2 @ X10))|~((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X13 @ X10 @ X4 @ X11)))), inference(split_conjunct,[status(thm)],[c_0_18])).
3.83/1.02	thf(c_0_24, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (hd_node @ rs2) @ ri @ i), inference(rw,[status(thm)],[c_0_19, c_0_20])).
3.83/1.02	thf(c_0_25, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (hd_node @ ri)), inference(rw,[status(thm)],[c_0_21, c_0_13])).
3.83/1.02	thf(c_0_26, negated_conjecture, ~((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ i)), inference(rw,[status(thm)],[c_0_22, c_0_9])).
3.83/1.02	thf(c_0_27, plain, ![X3:node, X2:list_node]:(((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X3 @ (append_node @ X2 @ (tl_node @ ri)) @ i)|~((graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X3 @ X2 @ (hd_node @ rs2))))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
3.83/1.02	thf(c_0_28, plain, (graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (hd_node @ rs2)), inference(rw,[status(thm)],[c_0_25, c_0_20])).
3.83/1.02	thf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])]), ['proof']).
3.83/1.02	# SZS output end CNFRefutation
3.83/1.02	# Parsed axioms                        : 419
3.83/1.02	# Removed by relevancy pruning/SinE    : 178
3.83/1.02	# Initial clauses                      : 571
3.83/1.02	# Removed in clause preprocessing      : 21
3.83/1.02	# Initial clauses in saturation        : 550
3.83/1.02	# Processed clauses                    : 1556
3.83/1.02	# ...of these trivial                  : 50
3.83/1.02	# ...subsumed                          : 248
3.83/1.02	# ...remaining for further processing  : 1258
3.83/1.02	# Other redundant clauses eliminated   : 2390
3.83/1.02	# Clauses deleted for lack of memory   : 0
3.83/1.02	# Backward-subsumed                    : 18
3.83/1.02	# Backward-rewritten                   : 23
3.83/1.02	# Generated clauses                    : 15160
3.83/1.02	# ...of the previous two non-redundant : 12231
3.83/1.02	# ...aggressively subsumed             : 0
3.83/1.02	# Contextual simplify-reflections      : 2
3.83/1.02	# Paramodulations                      : 12756
3.83/1.02	# Factorizations                       : 0
3.83/1.02	# NegExts                              : 0
3.83/1.02	# Equation resolutions                 : 2416
3.83/1.02	# Disequality decompositions           : 0
3.83/1.02	# Total rewrite steps                  : 1438
3.83/1.02	# ...of those cached                   : 1030
3.83/1.02	# Propositional unsat checks           : 0
3.83/1.02	#    Propositional check models        : 0
3.83/1.02	#    Propositional check unsatisfiable : 0
3.83/1.02	#    Propositional clauses             : 0
3.83/1.02	#    Propositional clauses after purity: 0
3.83/1.02	#    Propositional unsat core size     : 0
3.83/1.02	#    Propositional preprocessing time  : 0.000
3.83/1.02	#    Propositional encoding time       : 0.000
3.83/1.02	#    Propositional solver time         : 0.000
3.83/1.02	#    Success case prop preproc time    : 0.000
3.83/1.02	#    Success case prop encoding time   : 0.000
3.83/1.02	#    Success case prop solver time     : 0.000
3.83/1.02	# Current number of processed clauses  : 703
3.83/1.02	#    Positive orientable unit clauses  : 116
3.83/1.02	#    Positive unorientable unit clauses: 0
3.83/1.02	#    Negative unit clauses             : 59
3.83/1.02	#    Non-unit-clauses                  : 528
3.83/1.02	# Current number of unprocessed clauses: 11556
3.83/1.02	# ...number of literals in the above   : 41592
3.83/1.02	# Current number of archived formulas  : 0
3.83/1.02	# Current number of archived clauses   : 468
3.83/1.02	# Clause-clause subsumption calls (NU) : 52289
3.83/1.02	# Rec. Clause-clause subsumption calls : 19174
3.83/1.02	# Non-unit clause-clause subsumptions  : 134
3.83/1.02	# Unit Clause-clause subsumption calls : 4205
3.83/1.02	# Rewrite failures with RHS unbound    : 0
3.83/1.02	# BW rewrite match attempts            : 355
3.83/1.02	# BW rewrite match successes           : 5
3.83/1.02	# Condensation attempts                : 1556
3.83/1.02	# Condensation successes               : 0
3.83/1.02	# Termbank termtop insertions          : 284976
3.83/1.02	# Search garbage collected termcells   : 16423
3.83/1.02	
3.83/1.02	# -------------------------------------------------
3.83/1.02	# User time                : 0.469 s
3.83/1.02	# System time              : 0.021 s
3.83/1.02	# Total time               : 0.490 s
3.83/1.02	# Maximum resident set size: 4940 pages
3.83/1.02	
3.83/1.02	# -------------------------------------------------
3.83/1.02	# User time                : 0.481 s
3.83/1.02	# System time              : 0.025 s
3.83/1.02	# Total time               : 0.507 s
3.83/1.02	# Maximum resident set size: 2704 pages
3.83/1.02	% E---3.1 exiting
3.83/1.03	% E exiting
3.83/1.03	EOF